public class test {
	public static void main(String[] args) {
		int[] t = { 0, 10, 6, 9, 2, 4, 3, 7, 5, 1, 8 };
		int[] t2 = { 4, 2, 5, 1, 0 };
		int[] t1 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
		Quicksorter q = new Quicksorter();
		// q.sort(t1, 10);
		// for (int i = 0; i < t1.length; i++) {
		// System.out.print(t1[i]);
		// }
		FasterMergeSorter f = new FasterMergeSorter();
		MergeSorter f2 = new MergeSorter();
		Heapsort h = new Heapsort();
		// int num = 5;
		// int steps = 20;
		// f.sort(t, t.length - 1);
		// // Tester2 test = new Tester2(0, 1000, 20, steps, q, 0.95, 1, num);
		// Tester test1 = new Tester(0, 20000, 100, steps,
		// new Sorter[] { q, f, f2 });
		h.sort(t, t.length - 1);
		for (int i = 0; i < t.length; i++) {
			System.out.print(" " + t[i]);
		}
		// System.out.println("");
		// double[][] times = test1.startTesting();
		// for (int i = 0; i < 3; i++) {
		// System.out.println("");
		// for (int j = 0; j < steps; j++) {
		// System.out.print(" " + times[i][j]);
		// }
		// }

		// double[][] times2 = test.test();
		// for (int i = 0; i < num + 1; i++) {
		// System.out.println("");
		// for (int j = 0; j < steps; j++) {
		// System.out.print(" " + times2[i][j]);
		// }
		// }
	}
}
